Pseudo - Boolean and Finite Domain Constraint Programming : A Case
نویسندگان
چکیده
Pseudo-Boolean constraints are a special form of nite domain constraints where all variables are deened over the domain f0; 1g. To solve pseudo-Boolean constraints, specialized constraint solving algorithms have been developed. In this paper, we compare nite domain and pseudo-Boolean constraint techniques on a classical application of nite domain constraint programming, the warehouse location problem. Although the nite domain model is very natural and theoretically has a much smaller search space, the 0-1 model with specialized constraint solving techniques turns out to be more eecient.
منابع مشابه
Finite Domain and Cutting Plane Techniques in CLP(PB)
Finite domain constraints are one of the most important constraint domains in constraint logic programming. Usually, they are solved by local consistency techniques combined with enumeration. We argue that, in many cases, the concept of local consistency is too weak for both theoretical and practical reasons. We show how to obtain more information from a given constraint set by computing cuttin...
متن کاملLogic Programming with Pseudo-Boolean Constraints
Boolean constraints play an important role in various constraint logic programming languages. In this paper we consider pseudo-Boolean constraints, that is equations and inequalities between pseudo-Boolean functions. A pseudoBoolean function is an integer-valued function of Boolean variables and thus a generalization of a Boolean function. Pseudo-Boolean functions occur in many application area...
متن کاملCutting Planes in Constraint Logic Programming
In this paper, we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our approach is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case o...
متن کاملUniversal Booleanization of Constraint Models
While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mostly focused on the translation of specific types of constraints, such as pseudo Boolean constraints, finite integer linear constraints, and constraints given as explicit listings of allowed tuples. By contrast, we present a tr...
متن کاملA Hybrid BDD and SAT Finite Domain Constraint Solver
Finite-domain constraint solvers based on Binary Decision Diagrams (BDDs) are a powerful technique for solving constraint problems over finite set and integer variables represented as Boolean formulæ. Boolean Satisfiability (SAT) solvers are another form of constraint solver that operate on constraints on Boolean variables expressed in clausal form. Modern SAT solvers have highly optimized prop...
متن کامل